A Discrepancy Lower Bound for Information Complexity
نویسندگان
چکیده
منابع مشابه
A LeVeque-type Lower Bound for Discrepancy
A sharp lower bound for discrepancy on R/Z is derived that resembles the upper bound due to LeVeque. An analogous bound is proved for discrepancy on R/Z. These are discussed in the more general context of the discrepancy of probablity measures. As applications, the bounds are applied to Kronecker sequences and to a random walk on the torus.
متن کاملAn improved lower bound for the L2-discrepancy
We give an improved lower bound for the L2-discrepancy of finite point sets in the unit square.
متن کاملOptimal Complexity Lower Bound for Polynomial Multiplication
We prove lower bounds of order n logn for both the problem of multiplying polynomials of degree n, and of dividing polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower bounds are optimal up to order of magnitude. The proof uses a recent idea of R. Raz [Proc. 34th STOC 2002] proposed for matrix multiplication. It reduces the li...
متن کاملA lower bound for the determinantal complexity of a hypersurface
We prove that the determinantal complexity of a hypersurface of degree d > 2 is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least 5. As a result, we obtain that the determinantal complexity of the 3×3 permanent is 7. We also prove that for n > 3, there is no nonsingular hypersurface in Pn of degree d that has an expression as a dete...
متن کاملA Lower Complexity Bound for Propositional Dynamic Logic with Intersection
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponential time bounded Turing Machines.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0093-8